0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.14/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.33	% Computer   : n002.cluster.edu
0.14/0.33	% Model      : x86_64 x86_64
0.14/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.33	% Memory     : 8042.1875MB
0.14/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.33	% CPULimit   : 1200
0.14/0.33	% WCLimit    : 120
0.14/0.33	% DateTime   : Tue Jul 13 13:48:33 EDT 2021
0.14/0.33	% CPUTime    : 
0.14/0.33	% Number of cores: 8
0.14/0.34	% Python version: Python 3.6.8
0.14/0.34	# Version: 2.6rc1-ho
0.14/0.34	# No SInE strategy applied
0.14/0.34	# Trying AutoSched0 for 59 seconds
5.27/5.44	# AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
5.27/5.44	# and selection function SelectNewComplexAHPNS.
5.27/5.44	#
5.27/5.44	# Preprocessing time       : 0.029 s
5.27/5.44	
5.27/5.44	# Proof found!
5.27/5.44	# SZS status Theorem
5.27/5.44	# SZS output start CNFRefutation
5.27/5.44	thf(singletonprop, conjecture, ((((setext=>(uniqinunit=>(eqinunit=>![X1:$i, X2:$i > $o]:((singleton @ (dsetconstr @ X1 @ (^[X3:$i]:X2 @ X3))<=?[X3:$i]:(in @ X3 @ X1&X2 @ X3))<=![X3:$i]:(![X4:$i]:(in @ X4 @ X1=>(X2 @ X3=>(X2 @ X4=>(X3)=(X4))))<=in @ X3 @ X1)))))<=dsetconstrER)<=dsetconstrEL)<=dsetconstrI), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', singletonprop)).
5.27/5.44	thf(dsetconstrI, axiom, (dsetconstrI<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ X1=>(X2 @ X3=>in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrI)).
5.27/5.44	thf(dsetconstrEL, axiom, (dsetconstrEL<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>in @ X3 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrEL)).
5.27/5.44	thf(dsetconstrER, axiom, (dsetconstrER<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>X2 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrER)).
5.27/5.44	thf(setext, axiom, (setext<=>![X1:$i, X5:$i]:(![X3:$i]:(in @ X3 @ X1=>in @ X3 @ X5)=>(![X3:$i]:(in @ X3 @ X5=>in @ X3 @ X1)=>(X1)=(X5)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setext)).
5.27/5.44	thf(uniqinunit, axiom, (uniqinunit<=>![X3:$i, X4:$i]:(in @ X3 @ (setadjoin @ X4 @ emptyset)=>(X3)=(X4))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', uniqinunit)).
5.27/5.44	thf(eqinunit, axiom, (eqinunit<=>![X3:$i, X4:$i]:((X3)=(X4)=>in @ X3 @ (setadjoin @ X4 @ emptyset))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', eqinunit)).
5.27/5.44	thf(singleton, axiom, (singleton)=(^[X1:$i]:?[X3:$i]:(in @ X3 @ X1&(X1)=(setadjoin @ X3 @ emptyset))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', singleton)).
5.27/5.44	thf(c_0_8, plain, ![X3:$i, X2:$i > $o]:(epred1_2 @ X2 @ X3<=>X2 @ X3), introduced(definition)).
5.27/5.44	thf(c_0_9, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ X1=>(X2 @ X3=>in @ X3 @ (dsetconstr @ X1 @ (epred1_2 @ X2))))=>(![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred1_2 @ X2))=>in @ X3 @ X1)=>(![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred1_2 @ X2))=>X2 @ X3)=>(![X1:$i, X5:$i]:(![X3:$i]:(in @ X3 @ X1=>in @ X3 @ X5)=>(![X3:$i]:(in @ X3 @ X5=>in @ X3 @ X1)=>(X1)=(X5)))=>(![X3:$i, X4:$i]:(in @ X3 @ (setadjoin @ X4 @ emptyset)=>(X3)=(X4))=>(![X3:$i, X4:$i]:((X3)=(X4)=>in @ X3 @ (setadjoin @ X4 @ emptyset))=>![X1:$i, X2:$i > $o]:(![X3:$i]:(in @ X3 @ X1=>![X4:$i]:(in @ X4 @ X1=>(X2 @ X3=>(X2 @ X4=>(X3)=(X4)))))=>(?[X3:$i]:(in @ X3 @ X1&X2 @ X3)=>?[X28:$i]:(in @ X28 @ (dsetconstr @ X1 @ (epred1_2 @ X2))&(dsetconstr @ X1 @ (epred1_2 @ X2))=(setadjoin @ X28 @ emptyset))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[singletonprop]), dsetconstrI]), dsetconstrEL]), dsetconstrER]), setext]), uniqinunit]), eqinunit]), singleton]), c_0_8]), c_0_8]), c_0_8]), c_0_8]), c_0_8])])).
5.27/5.44	thf(c_0_10, plain, ![X52:$i, X53:$i > $o]:((~epred1_2 @ X53 @ X52|X53 @ X52)&(~X53 @ X52|epred1_2 @ X53 @ X52)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
5.27/5.44	thf(c_0_11, negated_conjecture, ![X29:$i, X30:$i > $o, X31:$i, X32:$i, X33:$i > $o, X34:$i, X35:$i, X36:$i > $o, X37:$i, X38:$i, X39:$i, X42:$i, X43:$i, X44:$i, X45:$i, X48:$i, X49:$i, X51:$i]:((~in @ X31 @ X29|(~X30 @ X31|in @ X31 @ (dsetconstr @ X29 @ (epred1_2 @ X30))))&((~in @ X34 @ (dsetconstr @ X32 @ (epred1_2 @ X33))|in @ X34 @ X32)&((~in @ X37 @ (dsetconstr @ X35 @ (epred1_2 @ X36))|X36 @ X37)&((((in @ (esk2_2 @ X38 @ X39) @ X39|(X38)=(X39)|in @ (esk1_2 @ X38 @ X39) @ X38)&(~in @ (esk2_2 @ X38 @ X39) @ X38|(X38)=(X39)|in @ (esk1_2 @ X38 @ X39) @ X38))&((in @ (esk2_2 @ X38 @ X39) @ X39|(X38)=(X39)|~in @ (esk1_2 @ X38 @ X39) @ X39)&(~in @ (esk2_2 @ X38 @ X39) @ X38|(X38)=(X39)|~in @ (esk1_2 @ X38 @ X39) @ X39)))&((~in @ X42 @ (setadjoin @ X43 @ emptyset)|(X42)=(X43))&(((X44)!=(X45)|in @ X44 @ (setadjoin @ X45 @ emptyset))&((~in @ X48 @ esk3_0|(~in @ X49 @ esk3_0|(~epred2_0 @ X48|(~epred2_0 @ X49|(X48)=(X49)))))&((in @ esk4_0 @ esk3_0&epred2_0 @ esk4_0)&(~in @ X51 @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))|(dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))!=(setadjoin @ X51 @ emptyset)))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])).
5.27/5.44	thf(c_0_12, plain, ![X2:$i > $o, X1:$i]:(epred1_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_10])).
5.27/5.44	thf(c_0_13, negated_conjecture, epred2_0 @ esk4_0, inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_14, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(in @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))|~in @ X1 @ X3|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_15, negated_conjecture, epred1_2 @ epred2_0 @ esk4_0, inference(spm,[status(thm)],[c_0_12, c_0_13])).
5.27/5.44	thf(c_0_16, negated_conjecture, ![X1:$i]:(~in @ X1 @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))|(dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))!=(setadjoin @ X1 @ emptyset)), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_17, negated_conjecture, ![X1:$i]:(in @ esk4_0 @ (dsetconstr @ X1 @ (epred1_2 @ (epred1_2 @ epred2_0)))|~in @ esk4_0 @ X1), inference(spm,[status(thm)],[c_0_14, c_0_15])).
5.27/5.44	thf(c_0_18, negated_conjecture, in @ esk4_0 @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_19, plain, ((setadjoin @ esk4_0 @ emptyset)!=(dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))|(epred1_2 @ epred2_0)!=(epred2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_16, c_0_17])])]), c_0_18])])).
5.27/5.44	thf(c_0_20, plain, ((setadjoin @ esk4_0 @ emptyset)!=(dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))|(epred1_2 @ epred2_0 @ esk8_0)!=(epred2_0 @ esk8_0)), inference(neg_ext,[status(thm)],[c_0_19])).
5.27/5.44	thf(c_0_21, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred1_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_10])).
5.27/5.44	thf(c_0_22, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(in @ X1 @ X3|~in @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_23, negated_conjecture, ![X3:$i, X1:$i]:(in @ (esk2_2 @ X1 @ X3) @ X3|(X1)=(X3)|in @ (esk1_2 @ X1 @ X3) @ X1), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_24, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(X2 @ X1|~in @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_25, plain, ((setadjoin @ esk4_0 @ emptyset)!=(dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))|~epred1_2 @ epred2_0 @ esk8_0), inference(csr,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_20]), c_0_21])).
5.27/5.44	thf(c_0_26, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((X1)=(dsetconstr @ X3 @ (epred1_2 @ X2))|in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))) @ X1|in @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))) @ X3), inference(spm,[status(thm)],[c_0_22, c_0_23])).
5.27/5.44	thf(c_0_27, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((X1)=(dsetconstr @ X3 @ (epred1_2 @ X2))|in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))) @ X1|X2 @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2)))), inference(spm,[status(thm)],[c_0_24, c_0_23])).
5.27/5.44	thf(c_0_28, plain, (setadjoin @ esk4_0 @ emptyset)!=(dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_20]), c_0_12]), c_0_25])).
5.27/5.44	thf(c_0_29, plain, ![X3:$i, X2:$i > $o, X1:$i]:((X1)=(dsetconstr @ X3 @ (epred1_2 @ X2))|epred1_2 @ (in @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2)))) @ X3|in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))) @ X1), inference(spm,[status(thm)],[c_0_12, c_0_26])).
5.27/5.44	thf(c_0_30, plain, ![X1:$i, X3:$i, X2:$i > $o]:((X1)=(dsetconstr @ X3 @ (epred1_2 @ X2))|in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2))) @ X1|epred1_2 @ X2 @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ (epred1_2 @ X2)))), inference(spm,[status(thm)],[c_0_12, c_0_27])).
5.27/5.44	thf(c_0_31, negated_conjecture, ![X1:$i, X3:$i]:((X1)=(X3)|~in @ X1 @ (setadjoin @ X3 @ emptyset)), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_32, plain, (in @ (esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))) @ (setadjoin @ esk4_0 @ emptyset)|epred1_2 @ (in @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))) @ esk3_0), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_28, c_0_29])])])])).
5.27/5.44	thf(c_0_33, plain, (in @ (esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))) @ (setadjoin @ esk4_0 @ emptyset)|epred1_2 @ epred2_0 @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_28, c_0_30])])])])).
5.27/5.44	thf(c_0_34, negated_conjecture, ![X1:$i, X3:$i]:((X1)=(X3)|~in @ X1 @ esk3_0|~in @ X3 @ esk3_0|~epred2_0 @ X1|~epred2_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_35, negated_conjecture, ((esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0)|epred1_2 @ (in @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))) @ esk3_0), inference(spm,[status(thm)],[c_0_31, c_0_32])).
5.27/5.44	thf(c_0_36, negated_conjecture, ((esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0)|epred1_2 @ epred2_0 @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))), inference(spm,[status(thm)],[c_0_31, c_0_33])).
5.27/5.44	thf(c_0_37, negated_conjecture, ![X1:$i]:((X1)=(esk4_0)|~in @ X1 @ esk3_0|~epred2_0 @ X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_18]), c_0_13])])).
5.27/5.44	thf(c_0_38, plain, ((esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0)|in @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))) @ esk3_0), inference(spm,[status(thm)],[c_0_21, c_0_35])).
5.27/5.44	thf(c_0_39, plain, ((esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0)|epred2_0 @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))), inference(spm,[status(thm)],[c_0_21, c_0_36])).
5.27/5.44	thf(c_0_40, negated_conjecture, ![X1:$i, X3:$i]:(in @ X1 @ (setadjoin @ X3 @ emptyset)|(X1)!=(X3)), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_41, negated_conjecture, ![X3:$i, X1:$i]:((X1)=(X3)|in @ (esk1_2 @ X1 @ X3) @ X1|~in @ (esk2_2 @ X1 @ X3) @ X1), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_42, negated_conjecture, ((esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0)|(esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39])).
5.27/5.44	thf(c_0_43, negated_conjecture, ![X1:$i]:in @ X1 @ (setadjoin @ X1 @ emptyset), inference(er,[status(thm)],[c_0_40])).
5.27/5.44	thf(c_0_44, negated_conjecture, ![X1:$i]:(in @ esk4_0 @ (dsetconstr @ X1 @ (epred1_2 @ epred2_0))|~in @ esk4_0 @ X1), inference(spm,[status(thm)],[c_0_14, c_0_13])).
5.27/5.44	thf(c_0_45, negated_conjecture, ![X1:$i, X3:$i]:(in @ (esk2_2 @ X1 @ X3) @ X3|(X1)=(X3)|~in @ (esk1_2 @ X1 @ X3) @ X3), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_46, negated_conjecture, (esk1_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_43])]), c_0_28]), c_0_31])).
5.27/5.44	thf(c_0_47, negated_conjecture, in @ esk4_0 @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)), inference(spm,[status(thm)],[c_0_44, c_0_18])).
5.27/5.44	thf(c_0_48, negated_conjecture, in @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_47])]), c_0_28])).
5.27/5.44	thf(c_0_49, negated_conjecture, ![X1:$i, X3:$i]:((X1)=(X3)|~in @ (esk2_2 @ X1 @ X3) @ X1|~in @ (esk1_2 @ X1 @ X3) @ X3), inference(split_conjunct,[status(thm)],[c_0_11])).
5.27/5.44	thf(c_0_50, negated_conjecture, in @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))) @ esk3_0, inference(spm,[status(thm)],[c_0_22, c_0_48])).
5.27/5.44	thf(c_0_51, negated_conjecture, epred2_0 @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))), inference(spm,[status(thm)],[c_0_24, c_0_48])).
5.27/5.44	thf(c_0_52, negated_conjecture, ~in @ (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0))) @ (setadjoin @ esk4_0 @ emptyset), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_46]), c_0_47])]), c_0_28])).
5.27/5.44	thf(c_0_53, negated_conjecture, (esk2_2 @ (setadjoin @ esk4_0 @ emptyset) @ (dsetconstr @ esk3_0 @ (epred1_2 @ epred2_0)))=(esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_50]), c_0_51])])).
5.27/5.44	thf(c_0_54, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52, c_0_53]), c_0_43])]), ['proof']).
5.27/5.44	# SZS output end CNFRefutation
5.27/5.44	# Proof object total steps             : 55
5.27/5.44	# Proof object clause steps            : 43
5.27/5.44	# Proof object formula steps           : 12
5.27/5.44	# Proof object conjectures             : 34
5.27/5.44	# Proof object clause conjectures      : 31
5.27/5.44	# Proof object formula conjectures     : 3
5.27/5.44	# Proof object initial clauses used    : 15
5.27/5.44	# Proof object initial formulas used   : 8
5.27/5.44	# Proof object generating inferences   : 20
5.27/5.44	# Proof object simplifying inferences  : 32
5.27/5.44	# Training examples: 0 positive, 0 negative
5.27/5.44	# Parsed axioms                        : 19
5.27/5.44	# Removed by relevancy pruning/SinE    : 0
5.27/5.44	# Initial clauses                      : 26
5.27/5.44	# Removed in clause preprocessing      : 11
5.27/5.44	# Initial clauses in saturation        : 15
5.27/5.44	# Processed clauses                    : 4055
5.27/5.44	# ...of these trivial                  : 0
5.27/5.44	# ...subsumed                          : 65
5.27/5.44	# ...remaining for further processing  : 3990
5.27/5.44	# Other redundant clauses eliminated   : 232136
5.27/5.44	# Clauses deleted for lack of memory   : 0
5.27/5.44	# Backward-subsumed                    : 8
5.27/5.44	# Backward-rewritten                   : 31
5.27/5.44	# Generated clauses                    : 603217
5.27/5.44	# ...of the previous two non-trivial   : 303525
5.27/5.44	# Contextual simplify-reflections      : 7
5.27/5.44	# Paramodulations                      : 186671
5.27/5.44	# Factorizations                       : 32
5.27/5.44	# NegExts                              : 46
5.27/5.44	# Equation resolutions                 : 232136
5.27/5.44	# Propositional unsat checks           : 0
5.27/5.44	#    Propositional check models        : 0
5.27/5.44	#    Propositional check unsatisfiable : 0
5.27/5.44	#    Propositional clauses             : 0
5.27/5.44	#    Propositional clauses after purity: 0
5.27/5.44	#    Propositional unsat core size     : 0
5.27/5.44	#    Propositional preprocessing time  : 0.000
5.27/5.44	#    Propositional encoding time       : 0.000
5.27/5.44	#    Propositional solver time         : 0.000
5.27/5.44	#    Success case prop preproc time    : 0.000
5.27/5.44	#    Success case prop encoding time   : 0.000
5.27/5.44	#    Success case prop solver time     : 0.000
5.27/5.44	# Current number of processed clauses  : 3946
5.27/5.44	#    Positive orientable unit clauses  : 3519
5.27/5.44	#    Positive unorientable unit clauses: 0
5.27/5.44	#    Negative unit clauses             : 1
5.27/5.44	#    Non-unit-clauses                  : 426
5.27/5.44	# Current number of unprocessed clauses: 299478
5.27/5.44	# ...number of literals in the above   : 1233689
5.27/5.44	# Current number of archived formulas  : 0
5.27/5.44	# Current number of archived clauses   : 43
5.27/5.44	# Clause-clause subsumption calls (NU) : 23855
5.27/5.44	# Rec. Clause-clause subsumption calls : 7051
5.27/5.44	# Non-unit clause-clause subsumptions  : 80
5.27/5.44	# Unit Clause-clause subsumption calls : 21804
5.27/5.44	# Rewrite failures with RHS unbound    : 0
5.27/5.44	# BW rewrite match attempts            : 1238580
5.27/5.44	# BW rewrite match successes           : 4
5.27/5.44	# Condensation attempts                : 0
5.27/5.44	# Condensation successes               : 0
5.27/5.44	# Termbank termtop insertions          : 12541874
5.27/5.46	
5.27/5.46	# -------------------------------------------------
5.27/5.46	# User time                : 4.988 s
5.27/5.46	# System time              : 0.131 s
5.27/5.46	# Total time               : 5.119 s
5.27/5.46	# Maximum resident set size: 1648 pages
5.27/5.46	EOF